Authenticated Byzantine Fault Tolerance Without Public-Key Cryptography
نویسندگان
چکیده
We have developed a practical state-machine replication algorithm that tolerates Byzantine faults: it works correctly in asynchronous systems like the Internet and it incorporates several optimizations that improve the response time of previous algorithms by more than an order of magnitude. This paper describes the most important of these optimizations. It explains how to modify the base algorithm to eliminate the major performance bottleneck in previous systems — public-key cryptography. The optimization replaces public-key signatures by vectors of message authentication codes during normal operation, and it overcomes a fundamental limitation on the power of message authentication codes relative to digital signatures — the inability to prove that a message is authentic to a third party. As a result, authentication is more than two orders of magnitude faster while providing the same level of
منابع مشابه
Improving Email Trustworthiness through Social-Group Key Authentication
The increasing use of email for phishing and unsolicited marketing has reduced the trustworthiness of email as a communication medium. Sender authentication is a known defense against these attacks. Existing proposals for sender authentication either require infrastructural support or break compatibility with existing email infrastructure. We propose, implement, and evaluate social-group key au...
متن کاملByzantine fault tolerant public key authentication in peer-to-peer systems
We describe Byzantine Fault Tolerant Authentication, a mechanism for public key authentication in peer-to-peer systems. Authentication is done without trusted third parties, tolerates Byzantine faults and is eventually correct if more than a threshold of the peers are honest. This paper addresses the design, correctness, and fault tolerance of authentication over insecure asynchronous networks....
متن کاملByzantine Fault Tolerant Authentication
A Byzantine fault tolerant public key infrastructure is presented. It aims to fulfill the authentication requirements of large distributed systems consisting of semi-trusted parties. The distributed trust model does not demand the existence of predefined trusted parties and provides authentication if more than a threshold of the participants are honest. A voting based protocol implements distri...
متن کاملAsynchronous Byzantine Consensus: Complexity, Resilience and Authentication (Preliminary Version)
We present a consensus algorithm that tolerates Byzantine process failures and arbitrarily long periods of network asynchrony. Our algorithm is the first to match the general time-complexity lower bound of [14], for which we give a complete proof. When the necessary conditions for optimal communication latency are not met, our algorithm gracefully degrades and retains the time-complexity of pre...
متن کاملEfficient Synchronous Byzantine Consensus
We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates f Byzantine faults in an asynchronous setting using 3f +1 replicas, and has since been studied or deployed by numerous works. In this work, we improve the Byzantine fault tolerance threshold to n =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999